package Euler25;

import java.math.BigInteger;

public class FibonacciDigits {

	public static void main(String[] args) {
		BigInteger a = BigInteger.ONE;
		BigInteger b = BigInteger.ONE;
		BigInteger temp = BigInteger.ONE;
		int count = 2;
		
		while(b.toString().length()<1000)
		{
			temp = b;
			b = a.add(b);
			a = temp;
			count++;
		}
		
		System.out.println(count);
	}
}
